Axiomatizing logics of fuzzy preferences using graded modalities

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normal predicative logics with graded modalities

Absiraet. in this work we extend results from [4], [3] and [2] about propositional calculi with graded modalities to the predicative level. Our semantic is based on Kripke models with a single domain of interpretation for all the worlds. Therefore the axiomatic system will need a suitable generalization of the Barcan formula. We haven't considered semantics with world-relative domains because t...

متن کامل

General canonical models for graded normal logics (graded modalities IV)

We prove the canonical models introduced in [D] do not exist for some graded normal logics with symmetric models, namely KB ~ KBD ~ KBT ~ so that we define a new kind of canonical models, the general ones, and show they exist and work well in every case.

متن کامل

Modifier Logics Based on Graded Modalities

Modifier logics are considered as generalizations of "classiea1" modal logics. Thus modifier logics are soeanled multimodal logios. Multimodality means here that the basic logics are modal logics with graded modalities. The interpretation of modal operators is more generan, too. Leibniz's mottvating semantical ideas (see [8]. p. 20-21) givejustification to these generalizations. Semantics of ca...

متن کامل

Decidability by Filtrations for graded normal logics (graded modalities V)

1. I n t r o d u c t i o n Graded normal logics ( G N L s ) are the extensions of modal normal logics to a language with graded modalities. The interpretation in usual Kripke models of a formula <>hA (n < w), whose main operator is a graded possibility, is there are more than n accessible worlds where A is true. When graded modalities were introduced (in [7], independently rediscovering a forme...

متن کامل

Axiomatizing Distance Logics

In [8, 6] we introduced a family of ‘modal’ languages intended for talking about distances. These languages are interpreted in ‘distance spaces’ which satisfy some (or all) of the standard axioms of metric spaces. Among other things, we singled out decidable logics of distance spaces and proved expressive completeness results relating classical and modal languages. The aim of this paper is to a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fuzzy Sets and Systems

سال: 2020

ISSN: 0165-0114

DOI: 10.1016/j.fss.2020.01.002